Modeling and Solving the Task Allocation Problem As an Unconstrained Quadratic Binary Program
نویسندگان
چکیده
Task allocation problems consist of assigning a set of tasks to one of several processors such that the associated inter-task communication and processing costs are minimized. Modeled as a nonlinear integer program, these problems are computationally challenging. This paper illustrates how the unconstrained quadratic binary program can be used to effectively model and efficiently solve large instances of the task allocation problem. Computational experience and a comparison to the state-ofthe-art commercial code (CPLEX) illustrate the attractiveness of our approach.
منابع مشابه
Graph Bisection Modeled as Binary Quadratic Task Allocation and Solved via Tabu Search
Balanced graph bisection is an NP-complete problem which partitions a set of nodes in the graph G = (N,E) into two sets with equal cardinality such that a minimal sum of edge weights exists between the nodes in the two separate sets. In this paper we transform graph bisection to capacitated task allocation using variable substitutions to remove most capacity and assignment constraints. The resu...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملAn Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods have been proposed for this difficult class of problems. Recent successes in the use of the unconstrained quadratic programming (UQP) model as a unified framework for modeling and solving combinatorial optimization proble...
متن کاملSolving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience reported in the literature with several problem classes has demonstrated that this approach works surprisingly well in terms of solution quality and computational times, often rivaling and sometimes surpassing more tradit...
متن کاملA Unified Framework for Modeling and Solving Combinatorial Optimization Problems: A Tutorial
In recent years the unconstrained quadratic binary program (UQP) has emerged as a unified framework for modeling and solving a wide variety of combinatorial optimization problems. This tutorial gives an introduction to this evolving area. The methodology is illustrated by several examples and substantial computational experience demonstrating the viability and robustness of the approach.
متن کامل